In this paper, an improved routing algorithm suitable for planar networksâ??static Zigbee\nand mesh networks includedâ??is shown. The algorithm is based on the cycle description of the graph,\nand on a new graph model based on arrow description, which is outlined. We show that the newly\ndeveloped model allows for a faster algorithm for finding a direct and a return path in the network.\nThe newly developed model allows further interpretations of the relationships in any simple planar\ngraphs. Examples showing the implementation of the newly developed model are presented too.
Loading....